Nuprl Lemma : finite-set-type-cases 11,40

T:Type, L:((T) List), P:(T).
(x:T. Dec(P(x)))
 (QLx:T. Dec(Q(x)))
 (QL. finite-type({x:TQ(x)} ))
 (x:TP(x (QL.Q(x)))
 finite-type({x:TP(x)} ) 
latex


Definitionsx:AB(x), , P  Q, x(s), t  T, xt(x), A  B, A, False, x:AB(x), Top, S  T, P  Q, P & Q, P  Q, {i..j}, i  j < k, (x  l), A c B, , SQType(T), {T}, T, True, t.1, xLP(x), (xL.P(x))
Lemmasfinite-decidable-set, l exists wf, l all wf2, finite-type wf, l member wf, decidable wf, select wf, select member, int seg wf, length wf1, concat wf, map wf, pi1 wf, upto wf, length wf nat, top wf, member-concat, exists functionality wrt iff, and functionality wrt iff, member map, le wf, member upto

origin